A Novel Multicriteria Optimization Technique for VLSI Floorplanning Based on Hybridized Firefly and Ant Colony Systems

نویسندگان

چکیده

In VLSI circuit design, physical design is one of the main steps in placing into chip area. Floorplanning a crucial step IC which generates blueprint for placement modules chip. A floorplanning accepts netlist as its input, given by circuit-partitioning design. The optimal placements modules. contains modules’ dimensions, size, and interconnect information. During floorplan generation, area, wire length required connecting heat generated chips can be estimated. good makes routing simple. order to improve performance minimizing length, peak temperature, it essential generate an optimized developing metaheuristic optimization algorithms. novel Hybridized Multicriteria Ant Colony Firefly Optimization (HMAC-FO) technique introduced floorplan. primary focus HMAC-FO model generating efficient floorplanning. standard MCNC benchmark dataset has number with their connections. algorithm HMAC-FO, been used thermal. firefly initially requires some solutions fireflies’ population. algorithm, usually, populations are randomly. But, algorithm’s obtain better optimum results, proposed uses ACO initial population, all solutions. set population globally result. experimented circuits, results prove that reduces area 3.48%, 0.64% temperature 3.33% than best existing methodology. methodology optimization, such generation.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Firefly Algorithm Based Ant Colony Optimization for Solving Combinatorial Optimization Problems

Inspired by ant colony optimization algorithm, a new firefly optimization algorithm is presented which we call firefly colony optimization algorithm (FCO). Unlike the standard firefly algorithm, the proposed approach is a distributed, and constructive greedy metaheuristic which uses the positive feedback to construct greedily good solutions, and to avoid a premature convergence to low quality s...

متن کامل

Novel Convex Optimization Approaches for VLSI Floorplanning

The floorplanning problem aims to arrange a set of rectangular modules on a rectangular chip area so as to optimize an appropriate measure of performance. This problem is known to be NP-hard, and is particularly challenging if the chip dimensions are fixed. Fixed-outline floorplanning is becoming increasingly important as a tool to design flows in the hierarchical design of Application Specific...

متن کامل

a novel differential evolution based optimization algorithm for non-sliceable vlsi floorplanning

floorplanning is an important step in physical design of vlsi circuits. it is used to plan the positions of a set of circuit modules on a chip in order to optimize the circuit performance. however, modern floorplanning takes better care of providing extra options to place dedicated modules in the hierarchical designs to align circuit blocks one by one within certain bounding box for helping seq...

متن کامل

A hybridization of evolutionary fuzzy systems and ant Colony optimization for intrusion detection

A hybrid approach for intrusion detection in computer networks is presented in this paper. The proposed approach combines an evolutionary-based fuzzy system with an Ant Colony Optimization procedure to generate high-quality fuzzy-classification rules. We applied our hybrid learning approach to network security and validated it using the DARPA KDD-Cup99 benchmark data set. The results indicate t...

متن کامل

Gradient-based Ant Colony Optimization for Continuous Spaces

A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3244346